package Offer.offer2016;


import domain.TreeNode;

import java.util.LinkedList;
import java.util.Queue;

public class Test23 {

    public static void main(String[] args) {
        TreeNode node1 = new TreeNode(1);
        TreeNode node2 = new TreeNode(2);
        TreeNode node3 = new TreeNode(3);
        TreeNode node4 = new TreeNode(4);
        TreeNode node5 = new TreeNode(5);
        TreeNode node6 = new TreeNode(6);
        TreeNode node7 = new TreeNode(7);
        node1.left = node2;
        node1.right = node3;
        node2.left = node4;
        node2.right = node5;
        node3.left = node6;
        node3.right = node7;
        node4.left = node4.right = null;
        node5.left = node4.right = null;
        node6.left = node4.right = null;
        node7.left = node4.right = null;
        printTree(node1);
    }

    public static void printTree(TreeNode root) {
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.offer(root);
        while (!queue.isEmpty()) {
            TreeNode p = queue.peek();
            System.out.print(p.val);
            System.out.print(" ");
            queue.poll();
            if (p.left != null)
                queue.offer(p.left);
            if (p.right != null)
                queue.offer(p.right);
        }


    }
}
